Uni-Rete : specializing the Rete match algorithm for the unique-attribute representation
نویسندگان
چکیده
The combinatorial match in production systems (rule-based systems) is problematical in several areas of production system application: real-time performance, learning new productions for performance improvement, modeling human cognition, and parallelization. The unique-attribute representation is a promising approach to eliminate match combinatorics. Earlier investigations have focused on the ability of unique-attributes to alleviate the problems caused by combinatorial match [Tambe, Newell and Rosenbloom 90]. This paper reports on an additional benefit of unique-attributes: a specialized match algorithm called Uni-Rete. Uni-Rete is a specialization of the widely used Rete match algorithm for unique-attributes, and it has shown over 10-fold speedup over Rete in performing match. This research was sponsored by the Avionics Laboratory, Wright Research and Development Center Aeronautical Systems Division (AFSC), U. S. Air Force, Wright-Patterson AFB, OH 45433-6543 under Contract F33615-90-C-1465, ARPA Order No. 7597. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the U.S. government. f o r m a t i o n Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, CA 90292.
منابع مشابه
An Efficient Algorithm for Production Systems with Linear-Time Match
Combinatorial match in production systems (rule-based system) is problematical in several areas of production system application: real-time performance, learning new productions for performance improvement. modeling human cognition. and parallelization. The unique-attribute representation in production systems is a promising approach to eliminate match combinatorics. Earlier investigations have...
متن کاملLana-Match Algorithm: A Parallel Version of the Rete-Match Algorithm
The Rete–Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper, a parallel version of the Rete–Match algorithm for distributed memory architecture is presented...
متن کاملTransforming Conjunctive Match into Rete: a Call-Graph Caching Approach
Conjunctive match is often used in Artificial Intelligence as the kernel of a pattern-directed inference [37] engine. Conjunctive match entails generating and testing all possible combinations of objects against a pattern of constraints. While simple to program, it is an expensive, exponential cost computation. To reduce this average match cost in production system engines, the RETE match algor...
متن کاملA new hybrid architecture for the discovery and compaction of knowledge: breast cancer datasets case study
This paper reports on the development of a new hybrid architecture that integrates Learning Classifier Systems (LCS) with Rete-based production systems inference engine to improve the performance of the process of compacting LCS generated rules. While LCS is responsible for generating a complete ruleset from a given breast cancer pathological data-set, an adapted Rete-based inference engine has...
متن کاملExtending the RETE Algorithm for Event Management
A growing number of industrial applications use rule-based programming. Frequently, the implementation of the inference engine embedded in these applications is based on the RETE algorithm. Some applications supervise a flow of events in which time, through the occurrence dates of the events, plays an important role. These applications need to be able to recognize patterns involving events. How...
متن کامل